Ant Homing Ability Is Not Diminished When Traveling Backwards
نویسندگان
چکیده
Ants are known to be capable of homing to their nest after displacement to a novel location. This is widely assumed to involve some form of retinotopic matching between their current view and previously experienced views. One simple algorithm proposed to explain this behavior is continuous retinotopic alignment, in which the ant constantly adjusts its heading by rotating to minimize the pixel-wise difference of its current view from all views stored while facing the nest. However, ants with large prey items will often drag them home while facing backwards. We tested whether displaced ants (Myrmecia croslandi) dragging prey could still home despite experiencing an inverted view of their surroundings under these conditions. Ants moving backwards with food took similarly direct paths to the nest as ants moving forward without food, demonstrating that continuous retinotopic alignment is not a critical component of homing. It is possible that ants use initial or intermittent retinotopic alignment, coupled with some other direction stabilizing cue that they can utilize when moving backward. However, though most ants dragging prey would occasionally look toward the nest, we observed that their heading direction was not noticeably improved afterwards. We assume ants must use comparison of current and stored images for corrections of their path, but suggest they are either able to chose the appropriate visual memory for comparison using an additional mechanism; or can make such comparisons without retinotopic alignment.
منابع مشابه
A Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem
The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...
متن کاملA Multiagent Approach To Solving Dynamic Traveling Salesman Problem
A multi-agent approach to solving dynamic Traveling Salesman Problem (TSP) is presented. In the dynamic version of TSP cities can be dynamically added or removed. Proposed multi-agent approach is based on the Sensitive Stigmergic Agent System model refined with new type of messages between agents. The agents send messages every time a change occurs, for instance, when an agent observes that a c...
متن کاملDACS3:Embedding Individual Ant Behavior in Ant Colony System
Ants are fascinating creatures that demonstrate the ability to find food and bring it back to their nest. Their ability as a colony, to find paths to food sources has inspired the development of algorithms known as Ant Colony Systems (ACS). The principle of cooperation forms the backbone of such algorithms, commonly used to find solutions to problems such as the Traveling Salesman Problem (TSP)...
متن کاملA dual population parallel ant colony optimization algorithm for solving the traveling salesman problem
In allusion to the phenomenon of stagnation and precocity during evolution in ant colony optimization (ACO) algorithm, this paper proposed a dual population parallel ant colony optimization (DPPACO) algorithm, which was applied to the traveling salesman problem. The DPPACO algorithm separated the ants into soldier ant population and worker ant population which evolve separately by parallel meth...
متن کاملImproved Clonal Selection Algorithm Combined with Ant Colony Optimization
Both the clonal selection algorithm (CSA) and the ant colony optimization (ACO) are inspired by natural phenomena and are effective tools for solving complex problems. CSA can exploit and explore the solution space parallely and effectively. However, it can not use enough environment feedback information and thus has to do a large redundancy repeat during search. On the other hand, ACO is based...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Frontiers in behavioral neuroscience
دوره 10 شماره
صفحات -
تاریخ انتشار 2016